Decidable Subsets of CCS
نویسنده
چکیده
Process algebra is a very interesting framework for describing and analyzing concurrent systems. Therefore CCS is used very often and considered pretty important. But it is undecidable if two CCS agents are bisimilar. Luckily Christensen, Hirshfeld and Moller showed 1994 in their paper “Decidable Subsets of CCS” that bisimulation for CCS without communication or without restriction and relabelling is decidable. As this subset is powerful enough for many problems, this is an interesting discovery. In addition they derived a complete axiomatisation for these two sublanguages. I want to present this work.
منابع مشابه
On the Expressive Power of Restriction and Priorities in CCS with Replication
We study the expressive power of restriction and its interplay with replication. We do this by considering several syntactic variants of CCS! (CCS with replication instead of recursion) which differ from each other in the use of restriction with respect to replication. We consider three syntactic variations of CCS! which do not allow the use of an unbounded number of restrictions: CCS−!ν ! is t...
متن کاملOn the Expressive Power of Restriction in CCS with Replication
Busi et al [8] showed that CCS! (CCS with replication instead of recursion) is Turing powerful by providing an encoding of Random Access Machines (RAMs) which preserves and reflects convergence (i.e., the existence of terminating computations). The encoding uses an unbounded number of restrictions arising from having restriction operators under the scope of replication. We study the expressive ...
متن کاملThe Decidability of the Reachability Problem for CCS!
CCS is a variant of CCS in which infinite behaviours are defined by the replication operator. We show that the reachability problem for CCS is decidable by a reduction to the same problem for Petri Nets.
متن کاملOn the expressive power of recursion, replication and iteration in process calculi
We investigate the expressive power of three alternative approaches for the definition of infinite behaviors in process calculi, namely, recursive definitions, replication and iteration. We prove several discrimination results between the calculi obtained from a core CCS by adding the three mechanisms mentioned above. These results are obtained by considering the decidability of four basic prop...
متن کاملSeparability of rational subsets by recognizable subsets is decidable in A∗ × N
Given a direct product of monoids M = A∗ ×N where A is finite and N is the additive monoid of nonnegative integers, the following problem is recursively decidable: given two rational subsests of M , does there exist a recognizable subset which includes one of the subsets and excludes the other.
متن کامل